Cryptographic Rational Secret Sharing Schemes over General Networks

We propose cryptographic rational secret sharing protocols over general networks. In a network, the dealer may not have direct connections to each player, and players of other players. present conditions on network topology for which our proposed are computational strict Nash equilibria (k−1)-resilient, along with analysis their round communication complexity. also new notions such as Φ-resilient equilibria, whereby protocol is resilient coalitions that satisfy in Φ, regardless coalition’s size. (n−1)-key leakage-tolerant applicable involving keys, equilibrium holds even if some acquire (n−1) tuples keys.